Tackling Real-Life Relaxed Concurrency with FSL++
نویسندگان
چکیده
We extend fenced separation logic (FSL), a program logic for reasoning about C11 relaxed access and memory fences. Our extensions to FSL allow us to handle concurrent algorithms appearing in practice. New features added to FSL allow for reasoning about concurrent nonatomic reads, atomic updates, ownership transfer via release sequences, and ghost state. As a demonstration of power of the extended FSL, we verify correctness of the atomic reference counter (ARC), a standard library of the Rust programing language, whose implementation relies heavily on advanced features of the C11 memory model. Soundness of FSL and its extensions, as well as the correctness proof of ARC have been established in Coq.
منابع مشابه
A Program Logic for C11 Memory Fences
We describe a simple, but powerful, program logic for reasoning about C11 relaxed accesses used in conjunction with release and acquire memory fences. Our logic, called fenced separation logic (FSL), extends relaxed separation logic with special modalities for describing state that has to be protected by memory fences. Like its precursor, FSL allows ownership transfer over synchronizations and ...
متن کاملQuantitative Comparison of SPM, FSL, and Brainsuite for Brain MR Image Segmentation
Background: Accurate brain tissue segmentation from magnetic resonance (MR) images is an important step in analysis of cerebral images. There are software packages which are used for brain segmentation. These packages usually contain a set of skull stripping, intensity non-uniformity (bias) correction and segmentation routines. Thus, assessment of the quality of the segmented gray matter (GM), ...
متن کاملRelaxed Balance through Standard Rotations
We consider binary search trees, where rebalancing transformations need not be connected with updates but may be delayed. For standard AVL tree rebalancing, we prove that even though the rebalancing operations are un-coupled from updates, their total number is bounded by O(M log(M +N)), where M is the number of updates to an AVL tree of initial size N. Hence, relaxed balancing of AVL trees come...
متن کاملExtension of hidden markov model for recognizing large vocabulary of sign language
Computers still have a long way to go before they can interact with users in a truly natural fashion. From a user’s perspective, the most natural way to interact with a computer would be through a speech and gesture interface. Although speech recognition has made significant advances in the past ten years, gesture recognition has been lagging behind. Sign Languages (SL) are the most accomplishe...
متن کاملChromatic Search Trees Revisited Institut F Ur Informatik | Report 91
Relaxed balancing of search trees was introduced with the aim of speeding up the updates and allowing a high degree of concurrency. In a relaxed version of a search tree the rebalancing operations are uncoupled from the updates and may be delayed. Using local transformations the rebalancing can be performed concurrently with updates and search operations. In this paper we revisit the rebalancin...
متن کامل